Hereditary History-Preserving Bisimilarity: Logics and Automata
نویسندگان
چکیده
We study hereditary history-preserving (hhp-) bisimilarity, a canonical behavioural equivalence in the true concurrent spectrum, by means of logics and automata. We first show that hhp-bisimilarity on prime event structures can be characterised in terms of a simple logic whose formulae just observe events in computations and check their executability. The logic suggests a characterisation of hhp-bisimilarity based on history-dependent automata, a formalism for modelling systems with dynamic allocation and deallocation of resources, where the history of resources is traced over time. Prime event structures can be naturally mapped into history-dependent automata in a way that hhp-bisimilarity exactly corresponds to the canonical behavioral equivalence for historydependent automata.
منابع مشابه
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To arrive at our characterization, we apply the open-maps framework of Joyal, Nielsen and Winskel in the category of unfoldings of precubical sets.
متن کاملHomotopy Bisimilarity for Higher-Dimensional Automata
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional automata into higher-dimensional trees. Using a notion of open maps in this category, we define homotopy bisimilarity. We show that homotopy bisimilarity is eq...
متن کاملLaboratory for Foundations of Computer Science Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems
History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...
متن کاملHereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems
History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...
متن کاملThe decidability border of hereditary history preserving bisimilarity
In 2000 Jurdziński and Nielsen proved that hereditary history preserving bisimilarity (hhp-b) is undecidable for finite systems [7,8], and thereby resolved a long-standing open problem. The negative outcome contrasts the weaker history preserving bisimilarity (hp-b), for which decidability is well-established [15,6]. A definition of (h)hp-b on labelled 1-safe Petri nets (net systems) follows.
متن کامل